The signed Eulerian numbers on involutions
نویسندگان
چکیده
We de ne an analog of signed Eulerian numbers fn,k for involutions of the symmetric group and derive some combinatorial properties of this sequence. In particular, we exhibit both an explicit formula and a recurrence for fn,k arising from the properties of its generating function.
منابع مشابه
Two Involutions for Signed Excedance Numbers
Two involutions on permutations and derangements are constructed. They lead to a direct evaluation of some signed Eulerian polynomials on permutations and derangements. The latter formulas, combined with the exponential formula, give a new derivation of the corresponding generating functions.
متن کاملOn the Eulerian Enumeration of Involutions
We consider in this work the enumeration of involutions by descent sets, and based on that, by descent numbers. Formulas of the number of involutions with a prescribed descent set, with a prescribed descent number and Frobenius-type formulas are given.
متن کاملA combinatorial approach to the power of 2 in the number of involutions
We provide a combinatorial approach to the largest power of p in the number of permutations π with π = 1, for a fixed prime number p. With this approach, we find the largest power of 2 in the number of involutions, in the signed sum of involutions and in the numbers of even or odd involutions.
متن کاملPermutation statistics on involutions
In this paper we look at polynomials arising from statistics on the classes of involutions, In, and involutions with no fixed points, Jn, in the symmetric group. Our results are motivated by F. Brenti’s conjecture [3] which states that the Eulerian distribution of In is logconcave. Symmetry of the generating functions is shown for the statistics d, maj and the joint distribution (d, maj). We sh...
متن کاملThe Eulerian distribution on centrosymmetric involutions
We present an extensive study of the Eulerian distribution on the set of centrosymmetric involutions, namely, involutions in Sn satisfying the property σ(i) + σ(n+ 1− i) = n+ 1 for every i = 1 . . . n. We find some combinatorial properties for the generating polynomial of such distribution, together with an explicit formula for its coefficients. Afterwards, we carry out an analogous study for t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008